Kinetic Convex Hull; an Analytical Approach
نویسندگان
چکیده
In this paper, first, we present a kinetic data structure for the problem of kinetic convex hull maintenance. After that, discuss some complicated cases followed by the main algorithm and two additional algorithms. Finally, focus on the evaluation of the four properties of the kinetic algorithm in the worst case. We show that quality factors of our algorithm are at most linear. Comparing with similar work, our suggestion is easier to implement and keep track of.
منابع مشابه
Active Data Structures and Applications to Dynamic and Kinetic Algorithms
We propose and study a novel data-structuring paradigm, called active data structures. Like a time machine, active data structures allow changes to occur not only in the present but at any point in time—including the past. Unlike most time machines, where changes to the past are incorporated and propagated automatically by magic, active data structures systematically communicate with the affect...
متن کاملKinetic convex hulls in the black-box model
Over the past decade, the kinetic-data-structures framework has become the standard in computational geometry for dealing with moving objects. A fundamental assumption underlying the framework is that the motions of the objects are known in advance. This assumption severely limits the applicability of KDSs. We study KDSs in the black-box model, which is a hybrid of the KDS model and the traditi...
متن کاملNew Data Structures and Algorithms for Mobile Data
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted list of the points in S, at any given time. We prove tight lower bounds for this problem, which show the following: with a subquadratic maintenance cost one cannot obtain any significant speed-up on the time needed to ge...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملL-CONVEX SYSTEMS AND THE CATEGORICAL ISOMORPHISM TO SCOTT-HULL OPERATORS
The concepts of $L$-convex systems and Scott-hull spaces are proposed on frame-valued setting. Also, we establish the categorical isomorphism between $L$-convex systems and Scott-hull spaces. Moreover, it is proved that the category of $L$-convex structures is bireflective in the category of $L$-convex systems. Furthermore, the quotient systems of $L$-convex systems are studied.
متن کامل